Distance Metrics and Clustering Methods for Mixed‐type Data
نویسندگان
چکیده
منابع مشابه
Distance metrics and data transformations
1 Distance metrics and similarity measures 2 1.1 Distance metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Vector norm and metric . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 The `p norm and `p metric . . . . . . . . . . . . . . . . . . . . . 4 1.4 Distance metric learning . . . . . . . . . . . . . . . . . . . . . . . 7 1.5 The mean as a similarity measure . . . . . . ...
متن کاملDistance Metrics and Data Transformation
2 Distance metrics and similarity measures 2 2.1 Distance metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Vector norm and metric . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 The `p norm and `p metric . . . . . . . . . . . . . . . . . . . . . 3 2.4 Distance metric learning . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 The mean as a similarity measure . . . . . . ...
متن کاملApproximate Greedy Clustering and Distance Selection for Graph Metrics
In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics. The first of these problems is the greedy permutation (or farthest-first traversal) of a finite metric space: a permutation of the points of the s...
متن کاملPractical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
Sequential agglomerative hierarchical non-overlapping (SAHN) clustering techniques belong to the classical clustering methods applied heavily in many application domains, e.g., in cheminformatics. Asymptotically optimal SAHN clustering algorithms are known for arbitrary dissimilarity measures, but their quadratic time and space complexity even in the best case still limits the applicability to ...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Statistical Review
سال: 2018
ISSN: 0306-7734,1751-5823
DOI: 10.1111/insr.12274